All-Shotest-Path 2-Interval Routing is NP-Complete
نویسندگان
چکیده
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc. A fundamental problem is to characterize the networks that admit k-IRS. All of the problems related to single-shortest-path k-IRS have already been shown to be NP-complete. For all-shortest-path k-IRS, the characterization problems have been proved to be NP-complete for every k > 3, and remain open for k = 1, 2. In this paper, we close the open case of k = 2 by showing that it is NP-complete to decide whether a graph admits an all-shortestpath 2-IRS. The same proof is also valid for all-shortest-path Strict 2-IRS. All-shortest-path Strict k-IRS is previously known to be polynomial for k = 1, open for k = 2, 3, and NP-complete for every constant k > 4.
منابع مشابه
On the hardness of minimizing space for all-shortest-path interval routing schemes
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-co...
متن کاملCharacterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1 ? LIRS (Linear Interval Routing Schemes). The characterization of all the other Interval Routing Schemes with uniform cost links that represent only a single shortest path is known to be NP-Complete. We also show that...
متن کاملThe Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing
Interval Routing is a routing method that was proposed in order to reduce the size of the routing tables by using intervals and was extensively studied and implemented. Some variants of the original method were also de2ned and studied. The question of characterizing networks which support optimal (i.e., shortest path) Interval Routing has been thoroughly investigated for each of the variants an...
متن کاملThe Complexity of Interval Routing on Random Graphs
Several methods exist for routing messages in a network without using complete routing tables (compact routing). In k-interval routing schemes (k-IRS), links carry up to k intervals each. A message is routed over a certain link if its destination belongs to one of the intervals of the link. We present some results for the necessary value of k in order to achieve shortest-path routing. Even thou...
متن کاملConsecutive ones Block for Symmetric Matrices
We show that a cubic graph G with girth g(G) ≥ 5 has a Hamiltonian Circuit if and only if the matrix A+ I can be row permuted such that each column has at most 2 blocks of consecutive 1’s, where A is the adjacency matrix of G, I is the unit matrix, and a block can be consecutive in circular sense, i.e., the first row and the last row are viewed as adjacent rows. Then, based on this necessary an...
متن کامل